ShortestPath

java.lang.Object
- edu.claflin.finder.algo.Algorithm
- - edu.claflin.finder.algo.ShortestPath

All Implemented Interfaces:

Processable<Graph,Graph>
```
public class ShortestPath
extends Algorithm
```

Nested Class Summary
- Nested classes/interfaces inherited from class edu.claflin.finder.algo.Algorithm
  Algorithm.GraphSortOrder

Field Summary
- Fields inherited from class edu.claflin.finder.algo.Algorithm
  args, counter, listener, PROP_PROGRESS

Constructor Summary

Constructors
Constructor Description

ShortestPath(ArgumentsBundle bundle)
Public Constructor for creating Shortest Path Algorithm.

Method Summary

All Methods Instance Methods Concrete Methods
Modifier and Type	Method	Description
`java.util.ArrayList<Graph>`	`process(Graph graph)`	Processes data.
`private Graph`	`removePaths(Graph graph, Node from, Node to)`	Private class for removing visited paths that not reach the destination node.

Methods inherited from class edu.claflin.finder.algo.Algorithm
addPropertyChangeListener, cull, getGraphSortOrder, getPartiteNumber, removePropertyChangeListener, setGraphSortOrder, setPartiteNumber, setProgress

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

- Constructor Detail
  - ShortestPath
```
public ShortestPath(ArgumentsBundle bundle)
```
    Public Constructor for creating Shortest Path Algorithm.
    
    Parameters:
    
    bundle - the ArgumentsBundle containing the arguments for the Algorithm object.
- Method Detail
  - process
```
public java.util.ArrayList<Graph> process(Graph graph)
```
    Description copied from interface: Processable
    
    Processes data.
    
    Parameters:
    
    graph - the T type object to process.
    
    Returns:
    
    the S type object array produced by the processing.
  - removePaths
```
private Graph removePaths(Graph graph,
                          Node from,
                          Node to)
```
    Private class for removing visited paths that not reach the destination node.
    
    Parameters:
    
    graph - the graph containing the shortest path with extra paths Algorithm object.